Dimensions and output
نویسندگان
چکیده
منابع مشابه
Orders of Input/Output Differential Equations and State Space Dimensions
This paper deals with the orders of input/output equations satisfied by nonlinear systems. Such equations represent differential (or difference, in the discrete-time case) relations between high-order derivatives (or shifts, respectively) of input and output signals. It is shown that, under analyticity assumptions, there cannot exist equations of order less than the minimal dimension of any obs...
متن کاملOrders of Input/output Diierential Equations and State Space Dimensions
This paper deals with the orders of input/output equations satissed by nonlinear systems. Such equations represent diierential (or diierence, in the discrete-time case) relations between high-order derivatives (or shifts, respectively) of input and output signals. It is shown that, under analyticity assumptions, there cannot exist equations of order less than the minimal dimension of any observ...
متن کاملOrders of Input/output Dierential Equations and State Space Dimensions
This paper deals with the orders of input/output equations satis ed by nonlinear systems. Such equations represent di erential (or di erence, in the discrete-time case) relations between highorder derivatives (or shifts, respectively) of input and output signals. It is shown that, under analyticity assumptions, there cannot exist equations of order less than the minimal dimension of any observa...
متن کاملOutput functions and fractal dimensions in dynamical systems.
We present a novel method for the calculation of the fractal dimension of boundaries in dynamical systems, which is in many cases many orders of magnitude more efficient than the uncertainty method. We call it the output function evaluation (OFE) method. We show analytically that the OFE method is much more efficient than the uncertainty method for boundaries with D<0.5, where D is the dimensio...
متن کاملOutput-Sensitive Tools for Range Searching in Higher Dimensions
Let P be a set of n points in R. A point p ∈ P is k-shallow if it lies in a halfspace which contains at most k points of P (including p). We show that if all points of P are k-shallow, then P can be partitioned into Θ(n/k) subsets, so that any hyperplane crosses at most O((n/k) log(n/k)) subsets. Given such a partition, we can apply the standard construction of a spanning tree with small crossi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the American Institute of Electrical Engineers
سال: 1921
ISSN: 0360-6449
DOI: 10.1109/joaiee.1921.6593591